Plane Recursive Trees, Stirling Permutations and an Urn Model
نویسنده
چکیده
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also prove results on the joint distribution of the numbers of ascents, descents and plateaux in a random Stirling permutation. The proof uses an interesting generalized Pólya
منابع مشابه
Generalized Stirling permutations, families of increasing trees and urn models
Bona [6] studied the distribution of ascents, plateaux and descents in the class of Stirling permutations, introduced by Gessel and Stanley [14]. Recently, Janson [18] showed the connection between Stirling permutations and plane recursive trees and proved a joint normal law for the parameters considered by Bona. Here we will consider generalized Stirling permutations extending the earlier resu...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملOn Path diagrams and Stirling permutations
Any ordinary permutation τ ∈ Sn of size n, written as a word τ = τ1 . . . τn, can be locally classified according to the relative order of τj to its neighbours. This gives rise to four local order types called peaks (or maxima), valleys (or minima), double rises and double falls. By the correspondence between permutations and binary increasing trees the classification of permutations according ...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملOn moment sequences and mixed Poisson distributions
In this article we survey properties of mixed Poisson distributions and probabilistic aspects of the Stirling transform: given a non-negative random variable X with moment sequence (μs)s∈N we determine a discrete random variable Y , whose moment sequence is given by the Stirling transform of the sequence (μs)s∈N, and identify the distribution as a mixed Poisson distribution. We discuss properti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008